Multiclass Total Variation Clustering
نویسندگان
چکیده
Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a general framework for multiclass total variation clustering that does not rely on recursion. The results greatly outperform previous total variation algorithms and compare well with state-of-the-art NMF approaches.
منابع مشابه
Multiclass Classification Based on Meta Probability Codes
This paper proposes a new approach to improve multiclass classi ̄cation performance by employing Stacked Generalization structure and One-Against-One decomposition strategy. The proposed approach encodes the outputs of all pairwise classi ̄ers by implicitly embedding twoclass discriminative information in a probabilistic manner. The encoded outputs, called Meta Probability Codes (MPCs), are inter...
متن کاملDesign of Decision Tree via Kernelized Hierarchical Clustering for Multiclass Support Vector Machines
As a very effective method for universal purpose pattern recognition, support vector machine (SVM) was proposed for dichotomic classification problem, which exhibits a remarkable resistance to overfitting, a feature explained by the fact that it directly implements the principle of structural risk minimization. However, in real world, most of classification problems consist of multiple categori...
متن کاملMulticlass Diffuse Interface Models for Semi-supervised Learning on Graphs
We present a graph-based variational algorithm for multiclass classification of high-dimensional data, motivated by total variation techniques. The energy functional is based on a diffuse interface model with a periodic potential. We augment the model by introducing an alternative measure of smoothness that preserves symmetry among the class labels. Through this modification of the standard Lap...
متن کاملSpectral clustering for multiclass Erdös-Rényi graphs
In this article, we study the properties of the spectral analysis of multiclass Erdös-Rényi graphs. With a view towards using the embedding afforded by the decomposition of the graph Laplacian for subsequent processing, we analyze two basic geometric properties, namely interclass intersection and interclass distance. We will first study the dyadic two-class case in details and observe the exist...
متن کاملBinary Classification Tree with Tuned Observation-based Clustering
There are several approaches for handling multiclass classification. Aside from one-against-one (OAO) and one-against-all (OAA), hierarchical classification technique is also commonly used. A binary classification tree is a hierarchical classification structure that breaks down a k-class problem into binary sub-problems, each solved by a binary classifier. In each node, a set of classes is divi...
متن کامل